Information-Based Complexity, Feedback and Dynamics in Convex Programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information-based complexity of uncertainty sets in feedback control

In this paper, a notion of information-based complexity is introduced to characterize complexities of plant uncertainty sets in feedback control settings, and to understand relationships between identification and feedback control in dealing with uncertainty. This new complexity measure extends the Kolmogorov entropy to problems involving information acquisition (identification) and processing ...

متن کامل

Feedback complexity, bounded rationality, and market dynamics

In a set of experimental markets, we investigate how the dynamic structure of the market as well as its price-setting institutions affect market performance and stability. We compare the outcomes to two alternative hypotheses: The standard neoclassical assumption of optimality and rational expectations, and a behavioral hypothesis based on previous studies of humans in dynamic decision making t...

متن کامل

Evolution of Information and Complexity in an Ever-Expanding Universe

Using the usual definitions of information and entropy in quantum gravity and statistical mechanics and the existing views about the relation between information and complexity, we examine the evolution of complexity in an ever expanding universe.

متن کامل

On the information-based complexity of stochastic programming

Existing complexity results in stochastic linear programming using the Turing model depend only on problem dimensionality. We apply techniques from the information-based complexity literature to show that the smoothness of the recourse function is just as important. We derive approximation error bounds for the recourse function of two-stage stochastic linear programs and show that their worst c...

متن کامل

Convex programming in optimal control and information theory

The main theme of this thesis is the development of computational methods for classes of infinite-dimensional optimization problems arising in optimal control and information theory. The first part of the thesis is concerned with the optimal control of discrete-time continuous space Markov decision processes (MDP). The second part is centred around two fundamental problems in information theory...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2011

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2011.2154375